A Multi-Phase Hybrid Metaheuristics Approach for the Exam Timetabling
نویسندگان
چکیده
We propose a Multi-Phase Hybrid Metaheuristics approach for solving the Exam Timetabling Problem (ETP). This approach includes a pre-processing phase, a construction phase and an enhancement phase. The pre-processing phase involves two stages: the propagation of ordering constraints and implicit constraints discovery stages. The construction phase uses a variant of the Tabu search with conflicts dictionary. The enhancement phase includes Hill Climbing (HC), Simulated Annealing (SA) and our updated version of the extended ”Great Deluge” algorithm. In order to evaluate the performance of the different phases of our proposed approach, we conducted several experiments on instances taken from the ITC 2007 benchmarking datasets. The results are very promising and competitive with the well known ETP solvers.
منابع مشابه
International Timetabling Competition A Hybrid Approach
This work arises from the research of the Metaheuristics Network on the University Course Timetabling Problem. In a first phase straightforward implementations of different metaheuristics were compared on a common local search framework [4]. In a second phase problem specific knoweldge was exploited and several alternatives for local search and metaheuristics were considered. Many possibilities...
متن کاملA Hybridization of Electromagnetic-Like Mechanism and Great Deluge for Examination Timetabling Problems
In this paper, we present a hybridization of an electromagneticlike mechanism (EM) and the great deluge (GD) algorithm. This technique can be seen as a dynamic approach as an estimated quality of a new solution and a decay rate are calculated at every iteration during the search process. These values are depending on a force value calculated using the EM approach. It is observed that applying t...
متن کاملGenerating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملHybrid Variable Neighborhood Approaches to Exam Timetabling
A very important factor for the success of a local search is the neighborhood employed during the search. Variable Neighborhood Search (VNS) algorithms [5] employ more than one neighborhood and change the employment of these neighborhoods during the search. It provides a very effective way of escaping from local optima and is both versatile and successful compared to other local search techniqu...
متن کاملHybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International Journal of Computational Intelligence and Applications
دوره 15 شماره
صفحات -
تاریخ انتشار 2016